parse trees造句
例句與造句
- the parse tree for this might look something like this
與此對應(yīng)的解析樹如下所示： - a special node to mark the end of the parse tree
標(biāo)志解析樹結(jié)束的特殊節(jié)點 - as data and not as a part of your parse tree
作為數(shù)據(jù)，而不是用它作為解析樹的一部分。 - the module of parsing tree is credible
其解析樹的生成模塊具有較高的可靠性和容錯能力。 - given the parse tree, you apply the algorithm in
給定解析樹，可以應(yīng)用 - It's difficult to find parse trees in a sentence. 用parse trees造句挺難的
- later on we will combine token sequences into parse trees
稍后我們會將記號序列組合成解析樹。 - your application could do more interesting things with the parse tree
您的應(yīng)用程序可以用解析樹做更多有趣的事情。 - the provider will reparse the codedom tree and pass the resulting parse tree to the
該提供程序?qū)⒅匦路治鯿odedom樹，并將生成的分析樹傳遞到 - in fact, the example parse tree you looked at previously is almost a valid scheme program
實際上，前面所研究的解析樹示例幾乎就是一個合法的scheme程序。 - it would be really interesting though, if there were a language that operated directly on parse trees
不過，真正值得關(guān)注的是，是否有直接操作解析樹的語言。 - the dfa construction algorithm converts this parse tree into a set of states, as the previous column explains
如前一篇專欄文章中所解釋的，dfa構(gòu)造算法將該解析樹轉(zhuǎn)換成一組狀態(tài)。 - for more on the front end and back end to return a parse tree that contains all the xpaths to recognize
以了解更多有關(guān)前端和后端的信息）返回一個包含所有要識別的xpath的解析樹。 - what s really interesting is that a large part of the parse trees of different languages are actually very similar
真正有趣之處在于，許多不同語言的大部分解析實際上是非常類似的。 - the algorithm essentially computes all the possible stack configurations that could lead to a given node in the parse tree
該算法必須計算所有可能的、可通向解析樹中給定節(jié)點的堆棧配置。 - even the programs written in scheme are merely lists that happen to also be parse trees, like the ones you played with previously
甚至使用scheme編寫的程序也是解析樹的列表，類似于前面所見的那些解析樹列表。
更多例句： 下一頁